Localizing Prime Idempotent Kernel Functors
نویسندگان
چکیده
منابع مشابه
Idempotent Monads and *-Functors
For an associative ring R, let P be an R-module with S = EndR(P). C. Menini and A. Orsatti posed the question of when the related functor HomR(P, −) (with left adjoint P ⊗S −) induces an equivalence between a subcategory of R M closed under factor modules and a subcategory of S M closed under submodules. They observed that this is precisely the case if the unit of the adjunction is an epimorphi...
متن کاملOn Kernel Rule's and Prime Implicants
We draw a simple correspondence between kernel rules and prime s’mphznts. Kernel (minimal) rules play an important role in many induction techniques. Prime implicants were previously used to formally model many other problem domains, including Boolean circuit minimization and such classical AI problems as diagnosis, truth maintenance and circumscription. This correspondence allows computing ker...
متن کاملNuclear Semimodules and Kernel Theorems in Idempotent Analysis. an Algebraic Approach
In this note we describe conditions under which, in idempotent functional analysis (see [1–3]), linear operators have integral representations in terms of idempotent integral of V. P. Maslov. We define the notion of nuclear idempotent semimodule and describe idempotent analogs of the classical kernel theorems of L. Schwartz and A. Grothendieck (see, e.g., [4–6]). In [11], for the idempotent sem...
متن کاملSOS Rule Formats for Idempotent Terms and Idempotent Unary Operators
A unary operator f is idempotent if the equation f(x) = f(f(x)) holds. On the other end, an element a of an algebra is said to be an idempotent for a binary operator if a = a a. This paper presents a rule format for Structural Operational Semantics that guarantees that a unary operator be idempotent modulo bisimilarity. The proposed rule format relies on a companion one ensuring that certain te...
متن کاملIdempotent permutations
Together with a characteristic function, idempotent permutations uniquely determine idempotent maps, as well as their linearly ordered arrangement simultaneously. Furthermore, in-place linear time transformations are possible between them. Hence, they may be important for succinct data structures, information storing, sorting and searching. In this study, their combinatorial interpretation is g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1975
ISSN: 0002-9939
DOI: 10.2307/2039741